联合二代Bandelet和Wavelet对图像进行分层压缩

一幅图像可以分解为匀质结构图和几何纹理图两个分量.基于这种思想,提出了一种使用二代Bandelet和小波对图像进行分层压缩的有效算法.首先,使用全变分方法把原始图像f分解为u和v两部分,其中u代表f中的结构分量,v代表纹理分量;对u进行小波变换,对v进行二代Bandelet变换.采用了自顶向下的四叉树分解算法,优化了二代Bandelet的四叉树建立过程.实验结果表明,该压缩方法的重建图像在视觉效果和客观SSIM值两方面均优于JPEG2000和Bandelets.     

防空武器系统总体效能的灰色层次评价模型

以某型防空导弹为例,首先建立防空武器系统总体效能评价指标,并采用效用函数法进行指标量化。在此基础上,采用AHP法和Dephi法确定权重系数,采用灰色方法计算综合评估值,从而建立一种综合灰色系统理论、AHP法和ADC法三者优点的灰色层次评价模型。最后对该型防空导弹进行仿真分析。结果证明,灰色层次评价法较AHP法和ADC法具有更大的合理性。     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

改进类电磁算法在武器目标分配问题中的应用

通过基于级数的粒子编码变换方法,将武器目标分配问题的约束条件进行了化简.对原始类电磁算法,在种群初始化、局部搜索、合力计算以及粒子移动等各步骤对其进行改造,使之适应武器目标分配问题的整数解空间.最后通过数值实验验证了该改造后算法解决武器目标分配问题的有效性.     

约束总体最小二乘空间配准算法

相对于单个雷达而言,组网雷达能显著提高其融合系统的性能,但是在随机误差较大情况下,由于空间配准精度往往较低,其融合性能会显著下降.在忽略模型线性化误差的情况下,分析出这一缺点出现的原因是量测方程的系数矩阵中存在误差,进而利用系数矩阵误差存在统计相关性的特点,提出一种基于地心地固坐标系(ECEF)的约束总体最小二乘算法进...     

加权核范数最小化和改进小波阈值函数的图像去噪算法

针对加权核范数最小化算法存在结构残余噪声以及无法较好地保持图像边缘结构的问题,提出基于加权核范数最小化和改进小波阈值函数的图像去噪算法。利用全变分模型对噪声图像进行初步去噪,使用噪声图像与初步去噪后的图像进行差分运算,对差分后得到的噪声残差图像使用改进的小波阈值函数去噪,将小波去噪后的残差图像与初步去噪图像叠加,将叠加后的图像使用基于残余噪声水平迭代的加权核范数最小化算法进行二次去噪。相较于当下主流去噪算法,经该算法处理后的图像的PSNR和SSIM值均有所提升,能够更好地保持图像的纹理结构,且在高噪声环境下效果更佳。     

浮空器气体混充定高建模与仿真

依据浮空器浮重平衡特性以及理想气体状态方程,探索了一种气体混充控制浮空器平飞高度的定高方式,并对浮空器气体混充定高技术进行了总体设计研究。考虑到热力学特性对于浮空器上升过程和平飞过程的重要性,结合工程热力学中混充气体的热物性能,以超压气球作为研究对象,分析球体上升和平飞过程中的热环境,并与动力学模型进行耦合。在此基础上,对混充气球上升及平飞过程进行力学仿真,得到气球上升过程中高度、速度、气体温度以及压强的变化,验证了浮空器混充定高技术的可行性,为后续浮空器飞行试验提供指导。     

弯曲致受抑全内反射式液位检测效应仿真实验分析

从传统的有损光纤结构的液位传感方法入手,深入研究塑料多模光纤传输过程中的包层模式下的弯曲损耗、受抑全内反射以及光能量耦合机理,在理论上揭示传感器效应的作用机制,从几何光学的理论出发,使用光线追迹方法,进一步模拟宏弯曲光纤内的光线传播路径,光纤受抑全内反射效应的能量变化机制,仿真结果与理论分析一致,搭建实验平台对前述理论分析和仿真模拟结果进行进一步的测试和验证。实验结果表明,该效应相对于传统有损光纤结构方法,可以进行高精度高灵敏度的稳定可靠液位传感测量。     

Constructing a strict total order for alternatives characterized by multiple criteria: An extension

The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014     

A note on scheduling parallel machines subject to breakdown and repair

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ C_j, the makespan C_max, and the maximum lateness L_max. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.